Language structure of pattern Sturmian words
نویسندگان
چکیده
Pattern Sturmian words introduced by Kamae and Zamboni KZ KZ are an analogy of Sturmian words for the maximal pattern com plexity instead of the block complexity So far two kinds of recur rent pattern Sturmian words are known namely rotation words and Toeplitz words But neither a structural characterization nor a reason able classi cation of the recurrent pattern Sturmian words is known In this paper we introduce a new notion pattern Sturmian sets which are used to study the language structure of pattern Sturmian words We prove that there are exactly two primitive structures for pattern Sturmian words Consequently we suggest a classi cation of pattern Sturmian words according to structures of pattern Sturmian sets and prove that there are at most three classes in this classi cation Ro tation words and Toeplitz words fall into two di erent classes but no examples of words from the third class are known
منابع مشابه
On the Structure of Bispecial Sturmian Words I
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, th...
متن کاملPeriodic and Sturmian languages
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as for infinite words, we prove that this complexity functions f(n) is either bounded or f(n) ≥ n+1. We call languages with bounded complexity periodic and languages with complexity f(n) = n + 1 Sturmian. We describe the...
متن کاملOn the Structure of Bispecial Sturmian Words
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, th...
متن کاملAbelian returns in Sturmian words
Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of return word, each of them gives rise to a new characterization of Sturmian words. We prove that a recurrent infinite word is Sturmian if and only if each of it...
متن کاملPalindromes in Sturmian Words
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006